from math import comb as c
n=int(input())
print(c(n,5)+c(n,6)+c(n,7))
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define prnt(x) for(auto &it: x)cout<<it<<" ";cout<<"\n";
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
typedef long long ll;
typedef vector<ll> vll;
const ll N = 780, inf=2e18;
ll mod = 1000000007;
ll func(ll n, ll r){
ll ans=1;
for(ll i=0; i<r; i++){
ans*=(n-i);
ans/=(i+1);
}
return ans;
}
void solve(ll tc)
{
ll n;
cin>>n;
ll ans=0;
for(ll i=5; i<=7; i++){
ans+=func(n, i);
}
cout<<ans<<endl;
}
int main()
{
fastio;ll T = 1;
//cin >> T;
for (ll i = 1; i <= T; i++)solve(i);
return 0;
}
1711A - Perfect Permutation | 1701B - Permutation |
1692A - Marathon | 1066A - Vova and Train |
169B - Replacing Digits | 171D - Broken checker |
380C - Sereja and Brackets | 1281B - Azamon Web Services |
1702A - Round Down the Price | 1681C - Double Sort |
12A - Super Agent | 1709A - Three Doors |
1680C - Binary String | 1684B - Z mod X = C |
1003A - Polycarp's Pockets | 1691B - Shoe Shuffling |
1706A - Another String Minimization Problem | 1695B - Circle Game |
1702B - Polycarp Writes a String from Memory | 1701A - Grass Field |
489C - Given Length and Sum of Digits | 886B - Vlad and Cafes |
915A - Garden | 356A - Knight Tournament |
1330A - Dreamoon and Ranking Collection | 1692B - All Distinct |
1156C - Match Points | 1675A - Food for Animals |
1328C - Ternary XOR | 1689A - Lex String |